Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
171	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
172	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
173	The Utility of Abstaining in Binary Classification Akshay Balsubramani University of California, San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2013-12-05 17:49:40 Mathematics Analysis of algorithms Supervised learning Algorithm Online machine learning Randomized algorithm Time complexity Statistical classification Margin classifier Theoretical computer science Applied mathematics Machine learning
174	Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri∗ , Constantinos Daskalakis† , Robert D. Kleinberg‡ , and Henry Lin† ∗ Information Theory and Applications Center, U.C. San Diego Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2011-01-01 02:41:47 Analysis of algorithms Combinatorial optimization Matching Randomized algorithm Load balancing Server SL Big O notation Hopcroft–Karp algorithm Theoretical computer science Computational complexity theory Mathematics
175	Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Randomized algorithm Time complexity Consensus Sorting network Theoretical computer science Applied mathematics Mathematics
176	CURRICULUM VITAE Michael T. Goodrich Dept. of Computer Science Bren School of Info. & Computer Sciences University of California, Irvine Irvine, CA Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2015-05-08 17:28:58 Discrete geometry Year of birth missing Michael T. Goodrich David Eppstein Journal of Graph Algorithms and Applications Straight skeleton Algorithm Randomized algorithm Voronoi diagram Mathematics Geometry Computational geometry
177	The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-10-26 12:29:22 NP-complete problems Analysis of algorithms Combinatorial optimization Matching Spanning tree Planar graph Nearest neighbor search Connectivity Randomized algorithm Graph theory Theoretical computer science Mathematics
178	Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:56:28 Analysis of algorithms Polynomials Algebraic geometry Commutative algebra Parameterized complexity XTR Kernelization Randomized algorithm Time complexity Theoretical computer science Mathematics Computational complexity theory
179	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Analysis of algorithms Triangulation Computational complexity theory Time complexity Algorithm Randomized algorithm Big O notation Delaunay triangulation Planar separator theorem Theoretical computer science Mathematics Applied mathematics
180	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics

UPDATE